منابع مشابه
Game-based cryptographic reductions
The concept of reduction in Cryptography, and the use of games to prove some definition of security were born as a response to the necessity of rigour in the field, which owes enormous contributions to theoretical mathematics, but is nevertheless applied. Cryptographic proofs are currently long and difficult to verify, making them prone to errors. A line of research in an attempt to make proofs...
متن کاملProbabilistic Polynomial Time is Closed under Parity Reductions
We show that probabilistic polynomial time (PP) is closed under polynomial-time parity reductions. As corollaries, we show that several complexity classes are contained in PP. Results Comparing the power of various computational paradigms is a central concern of computational complexity theory. In this paper, we study the power of PP by asking whether it is closed downwards under polynomial-tim...
متن کاملParity Games and Automata for Game Logic
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کاملPractical Improvements to Parity Game Solving
The aim of this thesis is to investigate how parity game problems may be solved efficiently in practice. Parity games are a worthwhile research topic because their simultaneous simplicity and expressiveness makes them a useful formalism to represent the problems that occur when formal methods are applied to software and hardware engineering. In this thesis, first an overview of the state of the...
متن کاملLocal Strategy Improvement for Parity Game Solving
The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy improvement algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2017
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-017-0301-x